A Maximal Eigenvalue Conjecture Equivalent to Permanental Dominance
نویسندگان
چکیده
Using concepts from the character theory of finite groups, it is shown that Lieb's Permanental Dominance Conjecture is equivalent to a certain maximal eigenvalue conjecture.
منابع مشابه
Permanental Mates: Perturbations and Hwang's conjecture
Let Ωn denote the set of all n × n doubly stochastic matrices. Two unequal matrices A and B in Ωn are called permanental mates if the permanent function is constant on the line segment t A + (1 − t)B, 0 ≤ t ≤ 1, connecting A and B. We study the perturbation matrix A + E of a symmetric matrix A in Ωn as a permanental mate of A. Also we show an example to disprove Hwang’s conjecture, which states...
متن کاملOn Permanental Polynomials of Certain Random Matrices
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided for several random matrix ensembles. When compared with the corresponding formulae for characteristic polynomials, our results show both striking similarities...
متن کاملImmanants and Finite Point Processes
Given a Hermitian, non-negativede nite kernelK and a character of the symmetric group on n letters, de ne the corresponding immanant functionK [x1; : : : ; xn ] := P ( ) Qn i=1 K(xi; x (i)), where the sum is over all permutations of f1; : : : ; ng. When is the sign character (resp. the trivial character), then K is a determinant (resp. permanent). The function K is symmetric and non-negative, a...
متن کاملThe Main Eigenvalues of the Undirected Power Graph of a Group
The undirected power graph of a finite group $G$, $P(G)$, is a graph with the group elements of $G$ as vertices and two vertices are adjacent if and only if one of them is a power of the other. Let $A$ be an adjacency matrix of $P(G)$. An eigenvalue $lambda$ of $A$ is a main eigenvalue if the eigenspace $epsilon(lambda)$ has an eigenvector $X$ such that $X^{t}jjneq 0$, where $jj$ is the all-one...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کامل